/*
源码更新策略: $_.exports
拷贝代码 全局引用 注意数组
第一次加载等 自运行函数加载完毕后赋值即可!!!
 */
$_ = {
    exports: {}
}

function Fuck(e) {
    for (var t, r, n = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+/=", a = "", o = "", i = 0, s = 0; r = e.charAt(s++); ~r && (t = i % 4 ? 64 * t + r : r,
    i++ % 4) ? a += String.fromCharCode(255 & t >> (-2 * i & 6)) : 0)
        r = n.indexOf(r);
    for (var c = 0, u = a.length; c < u; c++) {
        var l;
        o += "%" + ("00" + a.charCodeAt(c).toString(16)).slice(-2)

    }
    return decodeURIComponent(o)
}

!function (t, r) {
    function n(e) {
        for (var t = "", r = 0; r < e.length;) {
            var n = e.charCodeAt(r++);
            t += n > 63 ? String.fromCharCode(13 ^ n) : 35 == n ? e.charAt(r++) : String.fromCharCode(n)
        }
        return t
    }

    var a, o, c = [n("}l#r~h"), n("RhIlyl"), n("Rilyl"), n("nbcnly"), n("RcIlylOtyh~"), n("~djOtyh~"), n("nbcnly")],
        i = Function.prototype.call,
        s = [69, 73, 24, 30, 26, 2, 82, 23, 346, 61, 15, 79, 11, 44, 25, 0, 88, 25, 1, 30, 61, 61, 78, 24, 88, 27, 2, 25, 3, 30, 61, 24, 88, 77, 27, 4, 30, 27, 5, 75, 21, 4, 24, 70, 1, 35, 87, 42, 10, 0, 82, 51, 8, 347, 85, 85, 37, 72];

    function l(e, t) {
        var r = [
            "ntyWnKDPBhHPEG",
            "Aw5PDa",
            "nJiXmZG4ufvcvLjY",
            "B2jQzwn0",
            "ndi5mteWuLvZsw1Q",
            "mJbysgT3rNK",
            "mta0odmWnvfgEKrNAa",
            "Dg9tDhjPBMC",
            "twfSzM9YBwvKifvurI04igrHDge",
            "mJG2mZyXnNbfAvvLwa",
            "tMf0AxzLignYExb0BYbTB2r1BguGy291BgqGBM90igjLihvZzwqGDg8Gz2v0ihnLy3vYzsbYyw5KB20GBNvTyMvYlG",
            "mJe0ndyWnfbOELLlsW",
            "C3rYAw5N",
            "puXonKDp",
            "mZK4nJa5nNvste53qq"
        ]
        return l = function (t, n) {
            var a = r[t -= 334];
            var o = t + r[0].substring(0, 2)
                , c = e[o];
            return c ? a = c : (a = Fuck(a),
                e[o] = a),
                a
        }
            ,
            l(e, t)
    }

    o = function () {
        var t = t || function (r, n) {

            var o = function () {
                var e = l;
                if (a) {
                    if ("function" == typeof a.getRandomValues)
                        try {
                            return a.getRandomValues(new Uint32Array(1))[0]
                        } catch (e) {
                        }
                    if ("function" == typeof a.randomBytes)
                        try {
                            return a.randomBytes(4).readInt32LE()
                        } catch (e) {
                        }
                }
                throw new Error(e(344))
            }
                , u = Object.create || function () {
                function e() {
                }

                return function (t) {
                    var r;
                    return e.prototype = t,
                        r = new e,
                        e.prototype = null,
                        r
                }
            }()
                , h = {}
                , f = h.lib = {}
                , g = f.Base = {
                extend: function (e) {
                    var t = l
                        , r = u(this);
                    return e && r.mixIn(e),
                    (!r.hasOwnProperty(t(335)) || this.init === r.init) && (r.init = function () {
                            r.$super.init.apply(this, arguments)
                        }
                    ),
                        r.init.prototype = r,
                        r.$super = this,
                        r
                },
                create: function () {
                    var e = this.extend();
                    return e.init.apply(e, arguments),
                        e
                },
                init: function () {
                },
                mixIn: function (e) {
                    var t = l;
                    for (var r in e)
                        e.hasOwnProperty(r) && (this[r] = e[r]);
                    e.hasOwnProperty(t(341)) && (this.toString = e.toString)
                },
                clone: function () {
                    return this.init.prototype.extend(this)
                }
            }
                , p = f.WordArray = g.extend({
                init: function (e, t) {
                    e = this.words = e || [],
                        this.sigBytes = null != t ? t : 4 * e.length
                },
                toString: function (e) {
                    return (e || d).stringify(this)
                },
                concat: function (e) {
                    var t = this.words
                        , r = e.words
                        , n = this.sigBytes
                        , a = e.sigBytes;
                    if (this.clamp(),
                    n % 4)
                        for (var o = 0; o < a; o++) {
                            var c = r[o >>> 2] >>> 24 - o % 4 * 8 & 255;
                            t[n + o >>> 2] |= c << 24 - (n + o) % 4 * 8
                        }
                    else
                        for (o = 0; o < a; o += 4)
                            t[n + o >>> 2] = r[o >>> 2];
                    return this.sigBytes += a,
                        this
                },
                clamp: function () {
                    var e = this.words
                        , t = this.sigBytes;
                    e[t >>> 2] &= 4294967295 << 32 - t % 4 * 8,
                        e.length = r.ceil(t / 4)
                },

                clone: function () {
                    var e, t = g.clone.call(this);
                    e = this.words;
                    t.words = e.slice(0)
                    return t
                },
                random: function (e) {
                    for (var t = [], r = 0; r < e; r += 4)
                        t.push(o());
                    return new p.init(t, e)
                }
            })
                , v = h.enc = {}
                , d = v.Hex = {
                stringify: function (e) {
                    for (var t = e.words, r = e.sigBytes, n = [], a = 0; a < r; a++) {
                        var o = t[a >>> 2] >>> 24 - a % 4 * 8 & 255;
                        n.push((o >>> 4).toString(16)),
                            n.push((15 & o).toString(16))
                    }
                    return n.join("")
                },
                parse: function (e) {
                    for (var t = e.length, r = [], n = 0; n < t; n += 2)
                        r[n >>> 3] |= nm(e.substr(n, 2), 16) << 24 - n % 8 * 4;
                    return new p.init(r, t / 2)
                }
            };
            v.Utils = {
                toWordArray: function (e) {
                    for (var r = [], n = 0; n < e.length; n++)
                        r[n >>> 2] |= e[n] << 24 - n % 4 * 8;
                    return t.lib.WordArray.create(r, e.length)
                },
                fromWordArray: function (e) {
                    for (var t = new Uint8Array(e.sigBytes), r = 0; r < e.sigBytes; r++)
                        t[r] = e.words[r >>> 2] >>> 24 - r % 4 * 8 & 255;
                    return t
                }
            };
            var b = v.Latin1 = {
                stringify: function (e) {
                    for (var t = e.words, r = e.sigBytes, n = [], a = 0; a < r; a++) {
                        var o = t[a >>> 2] >>> 24 - a % 4 * 8 & 255;
                        n.push(String.fromCharCode(o))
                    }
                    return n.join("")
                },
                parse: function (e) {
                    for (var t = e.length, r = [], n = 0; n < t; n++)
                        r[n >>> 2] |= (255 & e.charCodeAt(n)) << 24 - n % 4 * 8;
                    return new p.init(r, t)
                }
            }
                , y = v.Utf8 = {
                stringify: function (e) {
                    var t = l;
                    try {
                        return decodeURIComponent(escape(b.stringify(e)))
                    } catch (e) {
                        throw new Error(t(342))
                    }
                },
                parse: function (e) {
                    return b.parse(unescape(encodeURIComponent(e)))
                }
            }
                , k = f.BufferedBlockAlgorithm = g.extend({
                reset: function () {
                    this._data = new p.init,
                        this._nDataBytes = 0
                },
                _append: function (e) {
                    for (var t, r, n = i, a = s, o = [], u = 0; ;)
                        switch (a[u++]) {
                            case 2:
                                o.push(t);
                                break;
                            case 15:
                                r = o.pop(),
                                    o[o.length - 1] = o[o.length - 1] == r;
                                break;
                            case 21:
                                o[o.length - 2][c[a[u++]]] = o[o.length - 1],
                                    o[o.length - 2] = o[o.length - 1],
                                    o.length--;
                                break;
                            case 23:
                                o.push(a[u++]);
                                break;
                            case 24:
                                o.pop();
                                break;
                            case 25:
                                o.push(o[o.length - 1]),
                                    o[o.length - 2] = o[o.length - 2][c[a[u++]]];
                                break;
                            case 26:
                                o[o.length - 1] = typeof o[o.length - 1];
                                break;
                            case 27:
                                o[o.length - 1] = o[o.length - 1][c[a[u++]]];
                                break;
                            case 30:
                                o.push(e);
                                break;
                            case 44:
                                o.push(y);
                                break;
                            case 61:
                                null != o[o.length - 2] ? (o[o.length - 3] = n.call(o[o.length - 3], o[o.length - 2], o[o.length - 1]),
                                    o.length -= 2) : (r = o[o.length - 3],
                                    o[o.length - 3] = r(o[o.length - 1]),
                                    o.length -= 2);
                                break;
                            case 69:
                                o.push(l);
                                break;
                            case 70:
                                return;
                            case 73:
                                t = o[o.length - 1];
                                break;
                            case 75:
                                r = o.pop(),
                                    o[o.length - 1] += r;
                                break;
                            case 77:
                                o.push(o[o.length - 1]);
                                break;
                            case 78:
                                e = o[o.length - 1];
                                break;
                            case 79:
                                o[o.length - 1] ? (++u,
                                    --o.length) : u += a[u];
                                break;
                            case 82:
                                o.push(null);
                                break;
                            case 88:
                                o.push(this)
                        }
                },
                _process: function (e) {
                    var t, n = this._data, a = n.words, o = n.sigBytes, c = this.blockSize, i = o / (4 * c),
                        s = (i = e ? r.ceil(i) : r.max((0 | i) - this._minBufferSize, 0)) * c, u = r.min(4 * s, o);
                    if (s) {
                        for (var l = 0; l < s; l += c)
                            this._doProcessBlock(a, l);
                        t = a.splice(0, s),
                            n.sigBytes -= u
                    }
                    return new p.init(t, u)
                },
                _eData: function (e) {
                    for (var t, r, n = i, a = s, o = [], u = 44; ;)
                        switch (a[u++]) {
                            case 1:
                                o.push(l);
                                break;
                            case 8:
                                o.push(a[u++]);
                                break;
                            case 10:
                                o.push(o[o.length - 1]),
                                    o[o.length - 2] = o[o.length - 2][c[6 + a[u++]]];
                                break;
                            case 35:
                                t = o[o.length - 1];
                                break;
                            case 37:
                                return o.pop();
                            case 42:
                                o.push(e);
                                break;
                            case 51:
                                o.push(null);
                                break;
                            case 72:
                                return;
                            case 82:
                                o.push(t);
                                break;
                            case 85:
                                null != o[o.length - 2] ? (o[o.length - 3] = n.call(o[o.length - 3], o[o.length - 2], o[o.length - 1]),
                                    o.length -= 2) : (r = o[o.length - 3],
                                    o[o.length - 3] = r(o[o.length - 1]),
                                    o.length -= 2);
                                break;
                            case 87:
                                o.pop()
                        }
                },
                clone: function () {
                    var e = g.clone.call(this);
                    return e._data = this._data.clone(),
                        e
                },
                _minBufferSize: 0
            });
            f.Hasher = k.extend({
                cfg: g.extend(),
                init: function (e) {
                    this.cfg = this.cfg.extend(e),
                        this.reset()
                },
                reset: function () {
                    k.reset.call(this),
                        this._doReset()
                },
                update: function (e) {
                    return this._append(e),
                        this._process(),
                        this
                },
                finalize: function (e) {
                    return e && this._append(e),
                        this._doFinalize()
                },
                blockSize: 16,
                _createHelper: function (e) {
                    return function (t, r) {
                        return new e.init(r).finalize(t)
                    }
                },
                _createHmacHelper: function (e) {
                    return function (t, r) {
                        return new m.HMAC.init(e, r).finalize(t)
                    }
                }
            });
            var m = h.algo = {};
            return h
        }(Math);
        return t
    }
        ,
        t.exports = o()
}($_)


R_ = {
    exports: {}
}
!function (t, r) {
    function n(e) {
        for (var t = "", r = 0; r < e.length;) {
            var n = e.charCodeAt(r++);
            t += n > 63 ? String.fromCharCode(57 ^ n) : 35 == n ? e.charAt(r++) : String.fromCharCode(n)
        }
        return t
    }

    var a, o, c = [n("UXJMpW]#eAv_"), n("JL[JMK"), n("ZVWZXM")], i = Function.prototype.call,
        s = [48, 4, 63, 67, 57, 0, 29, 79, 37, 190, 49, 49, 26, 63, 84, 37, -8512, 37, 5976, 12, 37, 2536, 12, 53, 28, 12, 67, 57, 1, 29, 79, 37, 190, 49, 31, 49, 61, 67, 57, 2, 29, 79, 37, 196, 49, 49, 61, 9];

    function u(e, t) {
        var r = [
            "mJK1nJq3ru92zeXo",
            "mtqWndqXrfbWrwn3",
            "mJa2odK3zNreveTr",
            "B2jQzwn0",
            "mJK0s0z3DhvJ",
            "mZiWmvDPwMXtva",
            "ndqWmdG0mhrNAKPQrG",
            "zw52q29SBgvJDa",
            "mZCWA05LuwfH",
            "oty3ntLOvLfKsKe",
            "ntaWyxnMrKjv",
            "mZy4zKDTCwz4",
            "nJa3oty1mgvbvePvqG",
            "puXonKDp",
            "lI9JB3jL"
        ]
        return u = function (t, n) {
            var a = r[t -= 183];
            var o = t + r[0].substring(0, 2)
                , c = e[o];
            return c ? a = c : (a = Fuck(a),
                e[o] = a),
                a
        }
            ,
            u(e, t)
    }

    o = function (e) {
        return function (t) {
            var r = e
                , n = r.lib
                , a = n.WordArray
                , o = n.Hasher
                , l = r.algo
                , h = [];
            !function () {
                for (var e = 0; e < 64; e++)
                    h[e] = 4294967296 * t.abs(t.sin(e + 1)) | 0
            }();
            var f = l.MD5 = o.extend({
                _doReset: function () {
                    this._hash = new a.init([1732584193, 4023233417, 2562383102, 271733878])
                },
                _doProcessBlock: function (e, t) {
                    for (var r = 0; r < 16; r++) {
                        var n = t + r
                            , a = e[n];
                        e[n] = 16711935 & (a << 8 | a >>> 24) | 4278255360 & (a << 24 | a >>> 8)
                    }
                    var o = this._hash.words
                        , c = e[t + 0]
                        , i = e[t + 1]
                        , s = e[t + 2]
                        , u = e[t + 3]
                        , l = e[t + 4]
                        , f = e[t + 5]
                        , b = e[t + 6]
                        , y = e[t + 7]
                        , k = e[t + 8]
                        , m = e[t + 9]
                        , w = e[t + 10]
                        , _ = e[t + 11]
                        , x = e[t + 12]
                        , S = e[t + 13]
                        , A = e[t + 14]
                        , E = e[t + 15]
                        , C = o[0]
                        , O = o[1]
                        , T = o[2]
                        , j = o[3];
                    C = g(C, O, T, j, c, 7, h[0]),
                        j = g(j, C, O, T, i, 12, h[1]),
                        T = g(T, j, C, O, s, 17, h[2]),
                        O = g(O, T, j, C, u, 22, h[3]),
                        C = g(C, O, T, j, l, 7, h[4]),
                        j = g(j, C, O, T, f, 12, h[5]),
                        T = g(T, j, C, O, b, 17, h[6]),
                        O = g(O, T, j, C, y, 22, h[7]),
                        C = g(C, O, T, j, k, 7, h[8]),
                        j = g(j, C, O, T, m, 12, h[9]),
                        T = g(T, j, C, O, w, 17, h[10]),
                        O = g(O, T, j, C, _, 22, h[11]),
                        C = g(C, O, T, j, x, 7, h[12]),
                        j = g(j, C, O, T, S, 12, h[13]),
                        T = g(T, j, C, O, A, 17, h[14]),
                        C = p(C, O = g(O, T, j, C, E, 22, h[15]), T, j, i, 5, h[16]),
                        j = p(j, C, O, T, b, 9, h[17]),
                        T = p(T, j, C, O, _, 14, h[18]),
                        O = p(O, T, j, C, c, 20, h[19]),
                        C = p(C, O, T, j, f, 5, h[20]),
                        j = p(j, C, O, T, w, 9, h[21]),
                        T = p(T, j, C, O, E, 14, h[22]),
                        O = p(O, T, j, C, l, 20, h[23]),
                        C = p(C, O, T, j, m, 5, h[24]),
                        j = p(j, C, O, T, A, 9, h[25]),
                        T = p(T, j, C, O, u, 14, h[26]),
                        O = p(O, T, j, C, k, 20, h[27]),
                        C = p(C, O, T, j, S, 5, h[28]),
                        j = p(j, C, O, T, s, 9, h[29]),
                        T = p(T, j, C, O, y, 14, h[30]),
                        C = v(C, O = p(O, T, j, C, x, 20, h[31]), T, j, f, 4, h[32]),
                        j = v(j, C, O, T, k, 11, h[33]),
                        T = v(T, j, C, O, _, 16, h[34]),
                        O = v(O, T, j, C, A, 23, h[35]),
                        C = v(C, O, T, j, i, 4, h[36]),
                        j = v(j, C, O, T, l, 11, h[37]),
                        T = v(T, j, C, O, y, 16, h[38]),
                        O = v(O, T, j, C, w, 23, h[39]),
                        C = v(C, O, T, j, S, 4, h[40]),
                        j = v(j, C, O, T, c, 11, h[41]),
                        T = v(T, j, C, O, u, 16, h[42]),
                        O = v(O, T, j, C, b, 23, h[43]),
                        C = v(C, O, T, j, m, 4, h[44]),
                        j = v(j, C, O, T, x, 11, h[45]),
                        T = v(T, j, C, O, E, 16, h[46]),
                        C = d(C, O = v(O, T, j, C, s, 23, h[47]), T, j, c, 6, h[48]),
                        j = d(j, C, O, T, y, 10, h[49]),
                        T = d(T, j, C, O, A, 15, h[50]),
                        O = d(O, T, j, C, f, 21, h[51]),
                        C = d(C, O, T, j, x, 6, h[52]),
                        j = d(j, C, O, T, u, 10, h[53]),
                        T = d(T, j, C, O, w, 15, h[54]),
                        O = d(O, T, j, C, i, 21, h[55]),
                        C = d(C, O, T, j, k, 6, h[56]),
                        j = d(j, C, O, T, E, 10, h[57]),
                        T = d(T, j, C, O, b, 15, h[58]),
                        O = d(O, T, j, C, S, 21, h[59]),
                        C = d(C, O, T, j, l, 6, h[60]),
                        j = d(j, C, O, T, _, 10, h[61]),
                        T = d(T, j, C, O, s, 15, h[62]),
                        O = d(O, T, j, C, m, 21, h[63]),
                        o[0] = o[0] + C | 0,
                        o[1] = o[1] + O | 0,
                        o[2] = o[2] + T | 0,
                        o[3] = o[3] + j | 0
                },
                _doFinalize: function () {
                    var e = this._data
                        , r = e.words
                        , n = 8 * this._nDataBytes
                        , a = 8 * e.sigBytes;
                    r[a >>> 5] |= 128 << 24 - a % 32;
                    var o = t.floor(n / 4294967296)
                        , c = n;
                    r[15 + (a + 64 >>> 9 << 4)] = 16711935 & (o << 8 | o >>> 24) | 4278255360 & (o << 24 | o >>> 8),
                        r[14 + (a + 64 >>> 9 << 4)] = 16711935 & (c << 8 | c >>> 24) | 4278255360 & (c << 24 | c >>> 8),
                        e.sigBytes = 4 * (r.length + 1),
                        this._process();
                    for (var i = this._hash, s = i.words, u = 0; u < 4; u++) {
                        var l = s[u];
                        s[u] = 16711935 & (l << 8 | l >>> 24) | 4278255360 & (l << 24 | l >>> 8)
                    }
                    return i
                },
                _eData: function (e) {
                    for (var t, r, n, a = i, o = s, l = [], h = 0; ;)
                        switch (o[h++]) {
                            case 4:
                                t = l[l.length - 1];
                                break;
                            case 9:
                                return;
                            case 12:
                                n = l.pop(),
                                    l[l.length - 1] += n;
                                break;
                            case 26:
                                r = l[l.length - 1];
                                break;
                            case 28:
                                l.pop() ? ++h : h += o[h];
                                break;
                            case 29:
                                l.push(t);
                                break;
                            case 31:
                                l[l.length - 1] = l[l.length - 1].length;
                                break;
                            case 37:
                                l.push(o[h++]);
                                break;
                            case 48:
                                l.push(u);
                                break;
                            case 49:
                                null != l[l.length - 2] ? (l[l.length - 3] = a.call(l[l.length - 3], l[l.length - 2], l[l.length - 1]),
                                    l.length -= 2) : (n = l[l.length - 3],
                                    l[l.length - 3] = n(l[l.length - 1]),
                                    l.length -= 2);
                                break;
                            case 53:
                                n = l.pop(),
                                    l[l.length - 1] = l[l.length - 1] === n;
                                break;
                            case 57:
                                l.push(l[l.length - 1]),
                                    l[l.length - 2] = l[l.length - 2][c[o[h++]]];
                                break;
                            case 61:
                                return l.pop();
                            case 63:
                                l.pop();
                                break;
                            case 67:
                                l.push(e);
                                break;
                            case 79:
                                l.push(null);
                                break;
                            case 84:
                                l.push(r)
                        }
                },
                clone: function () {
                    var e = o.clone.call(this);
                    return e._hash = this._hash.clone(),
                        e
                }
            });

            function g(e, t, r, n, a, o, c) {
                var i = e + (t & r | ~t & n) + a + c;
                return (i << o | i >>> 32 - o) + t
            }

            function p(e, t, r, n, a, o, c) {
                var i = e + (t & n | r & ~n) + a + c;
                return (i << o | i >>> 32 - o) + t
            }

            function v(e, t, r, n, a, o, c) {
                var i = e + (t ^ r ^ n) + a + c;
                return (i << o | i >>> 32 - o) + t
            }

            function d(e, t, r, n, a, o, c) {
                var i = e + (r ^ (t | ~n)) + a + c;
                return (i << o | i >>> 32 - o) + t
            }

            r.MD5 = o._createHelper(f),
                r.HmacMD5 = o._createHmacHelper(f)
        }(Math),
            e.MD5
    }
        ,
        t.exports = o($_.exports)
}(R_); // md5

var tA = {
    exports: {}
};
!function (e, t) {
    e.exports = $_.exports.enc.Utf8
}(tA);

var rA = {
    exports: {}
}
    , nA = {
    exports: {}
}
    , aA = {
    exports: {}
};
!function (e, t) {
    var r, n, a, o, c, i, s, u;
    e.exports = (n = (r = u = $_.exports).lib,
        a = n.WordArray,
        o = n.Hasher,
        c = r.algo,
        i = [],
        s = c.SHA1 = o.extend({
            _doReset: function () {
                this._hash = new a.init([1732584193, 4023233417, 2562383102, 271733878, 3285377520])
            },
            _doProcessBlock: function (e, t) {
                for (var r = this._hash.words, n = r[0], a = r[1], o = r[2], c = r[3], s = r[4], u = 0; u < 80; u++) {
                    if (u < 16)
                        i[u] = 0 | e[t + u];
                    else {
                        var l = i[u - 3] ^ i[u - 8] ^ i[u - 14] ^ i[u - 16];
                        i[u] = l << 1 | l >>> 31
                    }
                    var h = (n << 5 | n >>> 27) + s + i[u];
                    h += u < 20 ? 1518500249 + (a & o | ~a & c) : u < 40 ? 1859775393 + (a ^ o ^ c) : u < 60 ? (a & o | a & c | o & c) - 1894007588 : (a ^ o ^ c) - 899497514,
                        s = c,
                        c = o,
                        o = a << 30 | a >>> 2,
                        a = n,
                        n = h
                }
                r[0] = r[0] + n | 0,
                    r[1] = r[1] + a | 0,
                    r[2] = r[2] + o | 0,
                    r[3] = r[3] + c | 0,
                    r[4] = r[4] + s | 0
            },
            _doFinalize: function () {
                var e = this._data
                    , t = e.words
                    , r = 8 * this._nDataBytes
                    , n = 8 * e.sigBytes;
                return t[n >>> 5] |= 128 << 24 - n % 32,
                    t[14 + (n + 64 >>> 9 << 4)] = Math.floor(r / 4294967296),
                    t[15 + (n + 64 >>> 9 << 4)] = r,
                    e.sigBytes = 4 * t.length,
                    this._process(),
                    this._hash
            },
            clone: function () {
                var e = o.clone.call(this);
                return e._hash = this._hash.clone(),
                    e
            }
        }),
        r.SHA1 = o._createHelper(s),
        r.HmacSHA1 = o._createHmacHelper(s),
        u.SHA1)
}(aA);
var oA = {
    exports: {}
};

!function (t, r) {
    function n(e) {
        for (var t = "", r = 0; r < e.length;) {
            var n = e.charCodeAt(r++);
            t += n > 63 ? String.fromCharCode(25 ^ n) : 35 == n ? e.charAt(r++) : String.fromCharCode(n)
        }
        return t
    }

    var a, o,
        c = [n("pwpm"), n("Fqxjq|k"), n("ixkj|"), n("|R|`"), n("{uvzrJpc|"), n("jp~[`m|j"), n("#fpwxupc|"), n("zuxti"), n("zuvw|"), n("FvR|`"), n("FpR|`"), n("nvk}j"), -2154056612, n("k|j|m"), n("jiupm"), "", n("jupz|"), "pop", n("zqxkZv}|Xm"), n("#fkvtZqxkZv}|"), n("iljq"), n("zvwzxm"), n("svpw")],
        i = Function.prototype.call,
        s = [98, 15, 47, 80, 16, 54, 0, 97, 81, 51, 1, 31, 47, 55, 68, 75, 24, 18, 320, 61, 10, 32, 11, 72, 63, 2, 80, 63, 3, 55, 61, 61, 84, 47, 16, 54, 4, 41, 47, 45, 18, 9531, 18, -2477, 25, 18, -7050, 25, 27, 19, 47, 55, 54, 5, 71, 66, 32, 7, 16, 63, 6, 55, 61, 84, 47, 55, 63, 7, 22, 47, 80, 55, 63, 8, 22, 51, 9, 35, 47, 80, 55, 63, 8, 22, 51, 10, 7, 47, 38, 54, 11, 78, 47, 99, 54, 11, 53, 47, 18, -2392, 18, -3987, 25, 18, 6379, 25, 52, 47, 74, 33, 65, 85, 39, 36, 18, 1616378076, 87, 12, 25, 18, 2087235364, 25, 69, 90, 47, 11, 85, 39, 36, 18, 816503075, 18, 1348427146, 25, 18, -1255407735, 25, 69, 90, 47, 29, 47, 85, 45, 40, 64, -36, 38, 99, 71, 51, 5, 51, 5, 47, 80, 63, 13, 22, 47, 9, 29, 6, 0, 14, 1, 96, 44, 10, 78, 6, 2, 52, -2122, 52, -2818, 59, 52, 4940, 59, 52, -3641, 52, 4237, 59, 52, -593, 59, 57, 84, 10, 78, 6, 2, 52, -7341, 52, -9654, 59, 52, 16998, 59, 96, 5, 10, 21, 0, 8, 10, 55, 40, 92, 6, 3, 72, 6, 4, 52, 9568, 52, 7612, 59, 52, -17180, 59, 96, 83, 10, 61, 6, 5, 52, 6256, 52, 4163, 59, 52, -10261, 59, 90, 51, 96, 38, 10, 69, 6, 6, 66, 96, 10, 92, 48, 52, -1934, 52, 3266, 59, 52, -1332, 59, 3, 32, -51, 69, 6, 7, 53, 96, 8, 10, 69, 6, 8, 14, 1, 96, 46, 82];

    function u(e, t) {
        var r = [
            "C3rYAw5N",
            "ndaYntuXnwvczwXAyW",
            "ndu2odqXognwDgnHva",
            "mtjPqwH0uKy",
            "mJaWntGXCuDOtvLv",
            "mZeXoty3nMHtyNrVwq",
            "ndqYntCWnfLMELjPtG",
            "mZK1nZjVsKLJyKG",
            "n2TrDxDerW",
            "mJi0mtC3nfnmzLnwDq",
            "lI9JB3jL",
            "B2jQzwn0"
        ]
        return u = function (t, n) {
            var a = r[t -= 320];
            var o = t + r[0].substring(0, 2)
                , c = e[o];
            return c ? a = c : (a = Fuck(a),
                e[o] = a),
                a
        }
            ,
            u(e, t)
    }

    o = function (e) {
        var t, r, n;
        r = (t = e).lib.Base,
            n = t.enc.Utf8,
            t.algo.HMAC = r.extend({
                init: function (e, t) {
                    for (var r, a, o, l, h, f, g, p, v, d = i, b = s, y = [], k = 0; ;)
                        switch (b[k++]) {
                            case 7:
                                h = y[y.length - 1];
                                break;
                            case 9:
                                return;
                            case 10:
                                v = y.pop(),
                                    y[y.length - 1] = y[y.length - 1] == v;
                                break;
                            case 11:
                                y.push(g);
                                break;
                            case 15:
                                r = y[y.length - 1];
                                break;
                            case 16:
                                y.push(e);
                                break;
                            case 18:
                                y.push(b[k++]);
                                break;
                            case 19:
                                o = y[y.length - 1];
                                break;
                            case 22:
                                null != y[y.length - 1] ? y[y.length - 2] = d.call(y[y.length - 2], y[y.length - 1]) : (v = y[y.length - 2],
                                    y[y.length - 2] = v()),
                                    y.length--;
                                break;
                            case 24:
                                y.push(null);
                                break;
                            case 25:
                                v = y.pop(),
                                    y[y.length - 1] += v;
                                break;
                            case 27:
                                v = y.pop(),
                                    y[y.length - 1] *= v;
                                break;
                            case 29:
                                y.push(p++);
                                break;
                            case 31:
                                e = y[y.length - 1];
                                break;
                            case 32:
                                y[y.length - 1] ? (++k,
                                    --y.length) : k += b[k];
                                break;
                            case 35:
                                l = y[y.length - 1];
                                break;
                            case 36:
                                y[y.length - 2] = y[y.length - 2][y[y.length - 1]],
                                    y.length--;
                                break;
                            case 38:
                                y.push(l);
                                break;
                            case 39:
                                y.push(y[y.length - 2]),
                                    y.push(y[y.length - 2]);
                                break;
                            case 40:
                                v = y.pop(),
                                    y[y.length - 1] = y[y.length - 1] < v;
                                break;
                            case 41:
                                a = y[y.length - 1];
                                break;
                            case 45:
                                y.push(a);
                                break;
                            case 47:
                                y.pop();
                                break;
                            case 51:
                                y[y.length - 2][c[b[k++]]] = y[y.length - 1],
                                    y[y.length - 2] = y[y.length - 1],
                                    y.length--;
                                break;
                            case 52:
                                p = y[y.length - 1];
                                break;
                            case 53:
                                g = y[y.length - 1];
                                break;
                            case 54:
                                y[y.length - 1] = y[y.length - 1][c[b[k++]]];
                                break;
                            case 55:
                                y.push(t);
                                break;
                            case 61:
                                null != y[y.length - 2] ? (y[y.length - 3] = d.call(y[y.length - 3], y[y.length - 2], y[y.length - 1]),
                                    y.length -= 2) : (v = y[y.length - 3],
                                    y[y.length - 3] = v(y[y.length - 1]),
                                    y.length -= 2);
                                break;
                            case 63:
                                y.push(y[y.length - 1]),
                                    y[y.length - 2] = y[y.length - 2][c[b[k++]]];
                                break;
                            case 64:
                                y.pop() ? k += b[k] : ++k;
                                break;
                            case 65:
                                y.push(f);
                                break;
                            case 66:
                                v = y.pop(),
                                    y[y.length - 1] = y[y.length - 1] > v;
                                break;
                            case 68:
                                y[y.length - 1] = typeof y[y.length - 1];
                                break;
                            case 69:
                                v = y.pop(),
                                    y[y.length - 1] ^= v;
                                break;
                            case 71:
                                y.push(o);
                                break;
                            case 72:
                                y.push(n);
                                break;
                            case 74:
                                k += b[k];
                                break;
                            case 75:
                                y.push(r);
                                break;
                            case 78:
                                f = y[y.length - 1];
                                break;
                            case 80:
                                y.push(this);
                                break;
                            case 81:
                                y[y.length - 2] = new y[y.length - 2],
                                    y.length -= 1;
                                break;
                            case 84:
                                t = y[y.length - 1];
                                break;
                            case 85:
                                y.push(p);
                                break;
                            case 87:
                                y.push(c[b[k++]]);
                                break;
                            case 90:
                                y[y.length - 3][y[y.length - 2]] = y[y.length - 1],
                                    y[y.length - 3] = y[y.length - 1],
                                    y.length -= 2;
                                break;
                            case 97:
                                y.push(void 0);
                                break;
                            case 98:
                                y.push(u);
                                break;
                            case 99:
                                y.push(h)
                        }
                },
                reset: function () {
                    var e = this._hasher;
                    e.reset(),
                        e.update(this._iKey)
                },
                update: function (e) {
                    return this._hasher.update(e),
                        this
                },
                eKey: function (e) {
                    for (var t, r, n, a, o, u, l, h = i, f = s, g = [], p = 161; ;)
                        switch (f[p++]) {
                            case 3:
                                l = g.pop(),
                                    g[g.length - 1] = g[g.length - 1] > l;
                                break;
                            case 5:
                                n = g[g.length - 1];
                                break;
                            case 6:
                                g.push(g[g.length - 1]),
                                    g[g.length - 2] = g[g.length - 2][c[14 + f[p++]]];
                                break;
                            case 8:
                                a = g[g.length - 1];
                                break;
                            case 10:
                                g.pop();
                                break;
                            case 14:
                                g.push(c[14 + f[p++]]);
                                break;
                            case 21:
                                g.push(new Array(f[p++]));
                                break;
                            case 29:
                                g.push(e);
                                break;
                            case 32:
                                g.pop() ? p += f[p] : ++p;
                                break;
                            case 38:
                                u = g[g.length - 1];
                                break;
                            case 44:
                                t = g[g.length - 1];
                                break;
                            case 46:
                                return g.pop();
                            case 48:
                                g[g.length - 1] = g[g.length - 1].length;
                                break;
                            case 51:
                                l = g.pop(),
                                    g[g.length - 1] -= l;
                                break;
                            case 52:
                                g.push(f[p++]);
                                break;
                            case 53:
                                g.push(n);
                                break;
                            case 55:
                                p += f[p];
                                break;
                            case 57:
                                g[g.length - 4] = h.call(g[g.length - 4], g[g.length - 3], g[g.length - 2], g[g.length - 1]),
                                    g.length -= 3;
                                break;
                            case 59:
                                l = g.pop(),
                                    g[g.length - 1] += l;
                                break;
                            case 61:
                                g.push(String);
                                break;
                            case 66:
                                g.push(u);
                                break;
                            case 69:
                                g.push(a);
                                break;
                            case 72:
                                null != g[g.length - 1] ? g[g.length - 2] = h.call(g[g.length - 2], g[g.length - 1]) : (l = g[g.length - 2],
                                    g[g.length - 2] = l()),
                                    g.length--;
                                break;
                            case 78:
                                g.push(t);
                                break;
                            case 82:
                                return;
                            case 83:
                                o = g[g.length - 1];
                                break;
                            case 84:
                                r = g[g.length - 1];
                                break;
                            case 90:
                                g.push(o);
                                break;
                            case 92:
                                g.push(r);
                                break;
                            case 96:
                                null != g[g.length - 2] ? (g[g.length - 3] = h.call(g[g.length - 3], g[g.length - 2], g[g.length - 1]),
                                    g.length -= 2) : (l = g[g.length - 3],
                                    g[g.length - 3] = l(g[g.length - 1]),
                                    g.length -= 2)
                        }
                },
                finalize: function (e) {
                    var t, r = this._hasher, n = r.finalize(e);
                    return r.reset(),
                        r.finalize(
                            this._oKey.clone().concat(n)
                        )

                }
            })
    }
    t.exports = o($_.exports)
}(oA);
// hmac入口

!function (e, t) {
    var r, n, a, o, c, i, s, u;
    e.exports = (n = (r = u = $_.exports).lib,
        a = n.Base,
        o = n.WordArray,
        c = r.algo,
        i = c.MD5,
        s = c.EvpKDF = a.extend({
            cfg: a.extend({
                keySize: 4,
                hasher: i,
                iterations: 1
            }),
            init: function (e) {
                this.cfg = this.cfg.extend(e)
            },
            compute: function (e, t) {
                for (var r, n = this.cfg, a = n.hasher.create(), c = o.create(), i = c.words, s = n.keySize, u = n.iterations; i.length < s;) {
                    r && a.update(r),
                        r = a.update(e).finalize(t),
                        a.reset();
                    for (var l = 1; l < u; l++)
                        r = a.finalize(r),
                            a.reset();
                    j_(c).call(c, r)
                }
                return c.sigBytes = 4 * s,
                    c
            }
        }),
        r.EvpKDF = function (e, t, r) {
            return s.create(r).compute(e, t)
        }
        ,
        u.EvpKDF)
}(nA);
var iA = {
    exports: {}
};
!function (e, t) {
    var r;
    e.exports = (r = $_.exports,
        function (e) {
            var t = r
                , n = t.lib
                , a = n.WordArray
                , o = n.Hasher
                , c = t.algo
                , i = []
                , s = [];
            !function () {
                function t(t) {
                    for (var r = e.sqrt(t), n = 2; n <= r; n++)
                        if (!(t % n))
                            return !1;
                    return !0
                }

                function r(e) {
                    return 4294967296 * (e - (0 | e)) | 0
                }

                for (var n = 2, a = 0; a < 64;)
                    t(n) && (a < 8 && (i[a] = r(e.pow(n, .5))),
                        s[a] = r(e.pow(n, 1 / 3)),
                        a++),
                        n++
            }();
            var u = []
                , l = c.SHA256 = o.extend({
                _doReset: function () {
                    this._hash = new a.init(
                        i.slice(0)
                    )
                },
                _doProcessBlock: function (e, t) {
                    for (var r = this._hash.words, n = r[0], a = r[1], o = r[2], c = r[3], i = r[4], l = r[5], h = r[6], f = r[7], g = 0; g < 64; g++) {
                        if (g < 16)
                            u[g] = 0 | e[t + g];
                        else {
                            var p = u[g - 15]
                                , v = (p << 25 | p >>> 7) ^ (p << 14 | p >>> 18) ^ p >>> 3
                                , d = u[g - 2]
                                , b = (d << 15 | d >>> 17) ^ (d << 13 | d >>> 19) ^ d >>> 10;
                            u[g] = v + u[g - 7] + b + u[g - 16]
                        }
                        var y = n & a ^ n & o ^ a & o
                            , k = (n << 30 | n >>> 2) ^ (n << 19 | n >>> 13) ^ (n << 10 | n >>> 22)
                            ,
                            m = f + ((i << 26 | i >>> 6) ^ (i << 21 | i >>> 11) ^ (i << 7 | i >>> 25)) + (i & l ^ ~i & h) + s[g] + u[g];
                        f = h,
                            h = l,
                            l = i,
                            i = c + m | 0,
                            c = o,
                            o = a,
                            a = n,
                            n = m + (k + y) | 0
                    }
                    r[0] = r[0] + n | 0,
                        r[1] = r[1] + a | 0,
                        r[2] = r[2] + o | 0,
                        r[3] = r[3] + c | 0,
                        r[4] = r[4] + i | 0,
                        r[5] = r[5] + l | 0,
                        r[6] = r[6] + h | 0,
                        r[7] = r[7] + f | 0
                },
                _doFinalize: function () {
                    var t = this._data
                        , r = t.words
                        , n = 8 * this._nDataBytes
                        , a = 8 * t.sigBytes;
                    return r[a >>> 5] |= 128 << 24 - a % 32,
                        r[14 + (a + 64 >>> 9 << 4)] = e.floor(n / 4294967296),
                        r[15 + (a + 64 >>> 9 << 4)] = n,
                        t.sigBytes = 4 * r.length,
                        this._process(),
                        this._hash
                },
                clone: function () {
                    var e = o.clone.call(this);
                    return e._hash = this._hash.clone(),
                        e
                }
            });
            t.SHA256 = o._createHelper(l),
                t.HmacSHA256 = o._createHmacHelper(l)
        }(Math),
        r.SHA256)
}(iA); // SHA256


uA = {
    exports: {}
}
lA = {
    exports: {}
};
!function (e, t) {
    var r, n, a, o, c, i, s;
    e.exports = (a = (n = s = $_.exports).lib,
        o = a.Base,
        c = a.WordArray,
        (i = n.x64 = {}).Word = o.extend({
            init: function (e, t) {
                this.high = e,
                    this.low = t
            }
        }),
        i.WordArray = o.extend({
            init: function (e, t) {
                e = this.words = e || [],
                    this.sigBytes = t != r ? t : 8 * e.length
            },
            toX32: function () {
                for (var e = this.words, t = e.length, r = [], n = 0; n < t; n++) {
                    var a = e[n];
                    r.push(a.high),
                        r.push(a.low)
                }
                return c.create(r, this.sigBytes)
            },
            clone: function () {
                for (var e,
                         t = o.clone.call(this),
                         r = t.words = zk(e = this.words).call(e, 0),
                         n = r.length, a = 0; a < n; a++)
                    r[a] = r[a].clone();
                return t

            }
        }),
        s)
}(lA);
!function (e, t) {
    var r;
    e.exports = (r = $_.exports,
        function () {
            var e = r
                , t = e.lib.Hasher
                , n = e.x64
                , a = n.Word
                , o = n.WordArray
                , c = e.algo;

            function i() {
                return a.create.apply(a, arguments)
            }

            var s = [i(1116352408, 3609767458), i(1899447441, 602891725), i(3049323471, 3964484399), i(3921009573, 2173295548), i(961987163, 4081628472), i(1508970993, 3053834265), i(2453635748, 2937671579), i(2870763221, 3664609560), i(3624381080, 2734883394), i(310598401, 1164996542), i(607225278, 1323610764), i(1426881987, 3590304994), i(1925078388, 4068182383), i(2162078206, 991336113), i(2614888103, 633803317), i(3248222580, 3479774868), i(3835390401, 2666613458), i(4022224774, 944711139), i(264347078, 2341262773), i(604807628, 2007800933), i(770255983, 1495990901), i(1249150122, 1856431235), i(1555081692, 3175218132), i(1996064986, 2198950837), i(2554220882, 3999719339), i(2821834349, 766784016), i(2952996808, 2566594879), i(3210313671, 3203337956), i(3336571891, 1034457026), i(3584528711, 2466948901), i(113926993, 3758326383), i(338241895, 168717936), i(666307205, 1188179964), i(773529912, 1546045734), i(1294757372, 1522805485), i(1396182291, 2643833823), i(1695183700, 2343527390), i(1986661051, 1014477480), i(2177026350, 1206759142), i(2456956037, 344077627), i(2730485921, 1290863460), i(2820302411, 3158454273), i(3259730800, 3505952657), i(3345764771, 106217008), i(3516065817, 3606008344), i(3600352804, 1432725776), i(4094571909, 1467031594), i(275423344, 851169720), i(430227734, 3100823752), i(506948616, 1363258195), i(659060556, 3750685593), i(883997877, 3785050280), i(958139571, 3318307427), i(1322822218, 3812723403), i(1537002063, 2003034995), i(1747873779, 3602036899), i(1955562222, 1575990012), i(2024104815, 1125592928), i(2227730452, 2716904306), i(2361852424, 442776044), i(2428436474, 593698344), i(2756734187, 3733110249), i(3204031479, 2999351573), i(3329325298, 3815920427), i(3391569614, 3928383900), i(3515267271, 566280711), i(3940187606, 3454069534), i(4118630271, 4000239992), i(116418474, 1914138554), i(174292421, 2731055270), i(289380356, 3203993006), i(460393269, 320620315), i(685471733, 587496836), i(852142971, 1086792851), i(1017036298, 365543100), i(1126000580, 2618297676), i(1288033470, 3409855158), i(1501505948, 4234509866), i(1607167915, 987167468), i(1816402316, 1246189591)]
                , u = [];
            !function () {
                for (var e = 0; e < 80; e++)
                    u[e] = i()
            }();
            var l = c.SHA512 = t.extend({
                _doReset: function () {
                    this._hash = new o.init([new a.init(1779033703, 4089235720), new a.init(3144134277, 2227873595), new a.init(1013904242, 4271175723), new a.init(2773480762, 1595750129), new a.init(1359893119, 2917565137), new a.init(2600822924, 725511199), new a.init(528734635, 4215389547), new a.init(1541459225, 327033209)])
                },
                _doProcessBlock: function (e, t) {
                    for (var r = this._hash.words, n = r[0], a = r[1], o = r[2], c = r[3], i = r[4], l = r[5], h = r[6], f = r[7], g = n.high, p = n.low, v = a.high, d = a.low, b = o.high, y = o.low, k = c.high, m = c.low, w = i.high, _ = i.low, x = l.high, S = l.low, A = h.high, E = h.low, C = f.high, O = f.low, T = g, j = p, D = v, B = d, I = b, R = y, z = k, P = m, L = w, M = _, N = x, H = S, Y = A, F = E, K = C, X = O, J = 0; J < 80; J++) {
                        var G, W, U = u[J];
                        if (J < 16)
                            W = U.high = 0 | e[t + 2 * J],
                                G = U.low = 0 | e[t + 2 * J + 1];
                        else {
                            var Z = u[J - 15]
                                , q = Z.high
                                , V = Z.low
                                , Q = (q >>> 1 | V << 31) ^ (q >>> 8 | V << 24) ^ q >>> 7
                                , $ = (V >>> 1 | q << 31) ^ (V >>> 8 | q << 24) ^ (V >>> 7 | q << 25)
                                , ee = u[J - 2]
                                , te = ee.high
                                , re = ee.low
                                , ne = (te >>> 19 | re << 13) ^ (te << 3 | re >>> 29) ^ te >>> 6
                                , ae = (re >>> 19 | te << 13) ^ (re << 3 | te >>> 29) ^ (re >>> 6 | te << 26)
                                , oe = u[J - 7]
                                , ce = oe.high
                                , ie = oe.low
                                , se = u[J - 16]
                                , ue = se.high
                                , le = se.low;
                            W = (W = (W = Q + ce + ((G = $ + ie) >>> 0 < $ >>> 0 ? 1 : 0)) + ne + ((G += ae) >>> 0 < ae >>> 0 ? 1 : 0)) + ue + ((G += le) >>> 0 < le >>> 0 ? 1 : 0),
                                U.high = W,
                                U.low = G
                        }
                        var he, fe = L & N ^ ~L & Y, ge = M & H ^ ~M & F, pe = T & D ^ T & I ^ D & I,
                            ve = j & B ^ j & R ^ B & R,
                            de = (T >>> 28 | j << 4) ^ (T << 30 | j >>> 2) ^ (T << 25 | j >>> 7),
                            be = (j >>> 28 | T << 4) ^ (j << 30 | T >>> 2) ^ (j << 25 | T >>> 7),
                            ye = (L >>> 14 | M << 18) ^ (L >>> 18 | M << 14) ^ (L << 23 | M >>> 9),
                            ke = (M >>> 14 | L << 18) ^ (M >>> 18 | L << 14) ^ (M << 23 | L >>> 9), me = s[J],
                            we = me.high, _e = me.low, xe = K + ye + ((he = X + ke) >>> 0 < X >>> 0 ? 1 : 0),
                            Se = be + ve;
                        K = Y,
                            X = F,
                            Y = N,
                            F = H,
                            N = L,
                            H = M,
                            L = z + (xe = (xe = (xe = xe + fe + ((he += ge) >>> 0 < ge >>> 0 ? 1 : 0)) + we + ((he += _e) >>> 0 < _e >>> 0 ? 1 : 0)) + W + ((he += G) >>> 0 < G >>> 0 ? 1 : 0)) + ((M = P + he | 0) >>> 0 < P >>> 0 ? 1 : 0) | 0,
                            z = I,
                            P = R,
                            I = D,
                            R = B,
                            D = T,
                            B = j,
                            T = xe + (de + pe + (Se >>> 0 < be >>> 0 ? 1 : 0)) + ((j = he + Se | 0) >>> 0 < he >>> 0 ? 1 : 0) | 0
                    }
                    p = n.low = p + j,
                        n.high = g + T + (p >>> 0 < j >>> 0 ? 1 : 0),
                        d = a.low = d + B,
                        a.high = v + D + (d >>> 0 < B >>> 0 ? 1 : 0),
                        y = o.low = y + R,
                        o.high = b + I + (y >>> 0 < R >>> 0 ? 1 : 0),
                        m = c.low = m + P,
                        c.high = k + z + (m >>> 0 < P >>> 0 ? 1 : 0),
                        _ = i.low = _ + M,
                        i.high = w + L + (_ >>> 0 < M >>> 0 ? 1 : 0),
                        S = l.low = S + H,
                        l.high = x + N + (S >>> 0 < H >>> 0 ? 1 : 0),
                        E = h.low = E + F,
                        h.high = A + Y + (E >>> 0 < F >>> 0 ? 1 : 0),
                        O = f.low = O + X,
                        f.high = C + K + (O >>> 0 < X >>> 0 ? 1 : 0)
                },
                _doFinalize: function () {
                    var e = this._data
                        , t = e.words
                        , r = 8 * this._nDataBytes
                        , n = 8 * e.sigBytes;
                    return t[n >>> 5] |= 128 << 24 - n % 32,
                        t[30 + (n + 128 >>> 10 << 5)] = Math.floor(r / 4294967296),
                        t[31 + (n + 128 >>> 10 << 5)] = r,
                        e.sigBytes = 4 * t.length,
                        this._process(),
                        this._hash.toX32()
                },
                clone: function () {
                    var e = t.clone.call(this);
                    return e._hash = this._hash.clone(),
                        e
                },
                blockSize: 32
            });
            e.SHA512 = t._createHelper(l),
                e.HmacSHA512 = t._createHmacHelper(l)
        }(),
        r.SHA512)
}(uA); // SHA512

// hmac哈希算法
function HmacSHA256(encryptData, token) {
    return $_.exports.HmacSHA256(encryptData, token).toString()
}

function HmacSHA512(encryptData, token) {

    return $_.exports.HmacSHA512(encryptData, token).toString()
}

function HmacMD5(encryptData, token) {
    return $_.exports.HmacMD5(encryptData, token).toString()
}

// 标准哈希算法
function MD5(encryptData) {
    return $_.exports.MD5(encryptData).toString()
}

function SHA256(encryptData) {
    return $_.exports.SHA256(encryptData).toString()
}

function SHA512(encryptData) {
    return $_.exports.SHA512(encryptData).toString()
}

// console.log($_.exports.MD5('cute老师').toString())
// console.log($_.exports.SHA256('cute老师').toString())
// console.log($_.exports.SHA512('cute老师').toString())

// console.log($_.exports.HmacMD5('tk03wbd7b1c4518njZQQOto0hnRsGrIuTYUNUMF-Hnv36DWZOhZGvObBcuXoUtkGJcEFGtw2qlfmk3S365KY1Yu9S6jfy5yn69mt5ygiyzi7202406151330143937873806SIL8SBrCHTEe', 'tk03wbd7b1c4518njZQQOto0hnRsGrIuTYUNUMF-Hnv36DWZOhZGvObBcuXoUtkGJcEFGtw2qlfmk3S365KY1Yu9S6jf').toString())
console.log($_.exports.HmacSHA256('tk03wbd7b1c4518njZQQOto0hnRsGrIuTYUNUMF-Hnv36DWZOhZGvObBcuXoUtkGJcEFGtw2qlfmk3S365KY1Yu9S6jfy5yn69mt5ygiyzi7202406151330143937873806SIL8SBrCHTEe', 'tk03wbd7b1c4518njZQQOto0hnRsGrIuTYUNUMF-Hnv36DWZOhZGvObBcuXoUtkGJcEFGtw2qlfmk3S365KY1Yu9S6jf').toString())
// console.log($_.exports.HmacSHA512('tk03wbd7b1c4518njZQQOto0hnRsGrIuTYUNUMF-Hnv36DWZOhZGvObBcuXoUtkGJcEFGtw2qlfmk3S365KY1Yu9S6jfy5yn69mt5ygiyzi7202406151330143937873806SIL8SBrCHTEe', 'tk03wbd7b1c4518njZQQOto0hnRsGrIuTYUNUMF-Hnv36DWZOhZGvObBcuXoUtkGJcEFGtw2qlfmk3S365KY1Yu9S6jf').toString())

/*
检测: HmacSHA256
数据: 'tk03wbd7b1c4518njZQQOto0hnRsGrIuTYUNUMF-Hnv36DWZOhZGvObBcuXoUtkGJcEFGtw2qlfmk3S365KY1Yu9S6jfy5yn69mt5ygiyzi7202406151330143937873806SIL8SBrCHTEe'
秘钥: 'tk03wbd7b1c4518njZQQOto0hnRsGrIuTYUNUMF-Hnv36DWZOhZGvObBcuXoUtkGJcEFGtw2qlfmk3S365KY1Yu9S6jf'
结果: '5763329dd09d5e3c1e28734da031bb4d4e07ad4b78befd0807745a690ddd81e8'
日志trace:
'指令b[k]==>' ,b[k],' Y栈==>', JSON.stringify( y,(key, val)=>{if(val===window){return 'WINDOW'}else{return val}})
 */
